A HAMPSO-RBF Algorithm Applied to Target Localization
نویسندگان
چکیده
منابع مشابه
Householder Algorithm Applied to Localization for Wireless Sensor Networks
Many applications in Wireless Sensor Networks (WSNs) must know the position of sensor nodes in the network. That is, information from the sensors is useful only if node location information is also available. Additionally, some routing protocols use position to determine viable routes. Several localization algorithms have been proposed which can be categorized as: range-based and range-free alg...
متن کاملParticle Swarm Optimization Based Parameter Identification Applied to a Target Tracker Robot with Flexible Joint
This paper focuses on parameter identification of a target tracker robot possessing flexible joints using particle swarm optimization (PSO) algorithm. Since, belt and pulley mechanisms are known as flexible joints in robotic systems, their elastic behavior affecting a tracker robot is investigated in this work. First, dynamic equations governing the robot behavior are extracted taking into acco...
متن کاملRBF Nets in Faults Localization
The task of faults localization is discussed in a model-free setting. As a tool for its solution we consider a multiclass pattern recognition problem with a metric in the label space. Then, this problem is approximately solved, providing hints on selecting appropriate RBF nets. It was shown that the approximate solution is the exact one in several important cases. Finally, we propose the algori...
متن کاملH Filter and IMM Algorithm Applied On Target Tracking Problem
This paper discusses a new method of HIMM for the target tracking problem. This new method is a combination of the H∞ filter and the interactive multiple model (IMM) algorithm. The sub-filters of IMM algorithm are based on Kalman filter, in which the noise statistical characteristic should been known exactly, and in fact we only can get its approximatively models that worsen the performance of ...
متن کاملA Genetic Algorithm Applied to Graph
Many graph problems seek subsets of their vertices that maximize or minimize objective functions on the vertices. Among these are the capacitated p-median problem, the geometric connected dominating set problem, the capacitated k-center problem, and the traveling tourist problem. Prior genetic algorithms research in this area applied a simple mutation of an allele by random replacement. Recentl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AASRI Procedia
سال: 2012
ISSN: 2212-6716
DOI: 10.1016/j.aasri.2012.06.029